As a helpful and smart assistant, your task is to parse a given text in any language to Universal Dependency (UD) format including POS tags and dependency relations (HEAD and DEPREL).
Key Components of UD Annotation:
1. Tokens: The fundamental units within UD are tokens. These can be individual words, punctuation marks, or even parts of multi-word expressions. Each token has several associated attributes.
2. UPOS Tags: The UPOS field in the CoNLL-U format represents the universal part-of-speech tag assigned to each word. This tag is part of a universal POS tag set designed to be applicable across different languages. The UPOS tags include categories such as NOUN, VERB, ADJ (adjective), ADV (adverb), PRON (pronoun), DET (determiner), and more. 
3. Dependency Relations: Dependency relations are the core of the syntactic representation. They form a tree structure over the tokens in a sentence. Here's how they work:
    - HEAD: This field indicates the head of the current word. The head is the word that the current word is connected to in the dependency parse tree. The value is an integer that corresponds to the ID of the head word within the same sentence. A value of zero (0) indicates that the word is the root of the sentence.
    - DEPREL: The DEPREL field specifies the type of dependency relation between the current word and its head (as specified in the HEAD field). The value is a universal dependency relation or a language-specific subtype of such a relation.
Note: Blank lines are used to mark the boundaries between sentences.
Example:
Let's analyze this sentence with its UD annotation:
"The big dog chased the cat."
1. Tokenization:
- The
- big
- dog
- chased
- the
- cat
- .
2. UPOS Tags:
- The: DET
- big: ADJ
- dog: NOUN
- chased: VERB
- the: DET
- cat: NOUN
- .: PUNCT
3. Head node (parent):
- The: the parent of this word is "dog" at position 3
- big: the parent of this word is "dog" at position 3
- dog: the parent of this word is "chased" at position 4
- chased: this is the root node, therefore its head is 0
- the: the parent of this word is "cat" at position 6
- cat: the parent of this word is "chased" at position 4
- .: the parent of this word is "chased" at position 4
3. Dependency Relations:
- root(ROOT, chased)
- det(dog, The)
- amod(dog, big)
- nsubj(chased, dog)
- det(cat, the)
- obj(chased, cat)
Combining the above annotations, the final output in UD format is:
Position	Tokenization	UPOS	Head	Deprel
1	The	DET	3	det
2	big	ADJ	3	amod
3	dog	NOUN	4	nsubj
4	chased	VERB	0	ROOT
5	the	DET	6	det
6	cat	NOUN	4	obj
7	.	PUNCT	4	punct
Generate UD annotations for the following tokenized text:
Le théorème de Pólya peut être utilisé pour calculer le nombre de graphes sur ces m sommets à isomorphisme près, c'est-à-dire le nombre d'orbites des coloriages de X sous l'action du groupe symétrique G = S, qui permute les sommets donc les paires de sommets.
Postion	Tokenization
1	Le
2	théorème
3	de
4	Pólya
5	peut
6	être
7	utilisé
8	pour
9	calculer
10	le
11	nombre
12	de
13	graphes
14	sur
15	ces
16	m
17	sommets
18	à
19	isomorphisme
20	près
21	,
22	c'est-à-dire
23	le
24	nombre
25	d'
26	orbites
27	des
28	de
29	les
30	coloriages
31	de
32	X
33	sous
34	l'
35	action
36	du
37	de
38	le
39	groupe
40	symétrique
41	G
42	=
43	S
44	,
45	qui
46	permute
47	les
48	sommets
49	donc
50	les
51	paires
52	de
53	sommets
54	.
Position	Tokenization	UPOS	Head	Deprel
1	Le	DET	2	det
2	théorème	NOUN	5	nsubj
3	de	ADP	4	case
4	Pólya	PROPN	2	nmod
5	peut	VERB	0	root
6	être	AUX	7	aux:pass
7	utilisé	VERB	5	xcomp:obj
8	pour	ADP	9	mark
9	calculer	VERB	7	xcomp:obl
10	le	DET	11	det
11	nombre	NOUN	9	obj
12	de	ADP	13	case
13	graphes	NOUN	11	nmod
14	sur	ADP	17	case
15	ces	DET	17	det
16	m	NUM	17	nummod
17	sommets	NOUN	13	nmod
18	à	ADP	19	case
19	isomorphisme	NOUN	11	nmod
20	près	ADV	19	dep:comp
21	,	PUNCT	24	punct
22	c'est-à-dire	ADV	24	cc
23	le	DET	24	det
24	nombre	NOUN	11	conj
25	d'	ADP	26	case
26	orbites	NOUN	24	nmod
27	des	_	None	_
28	de	ADP	29	case
29	les	DET	29	det
30	coloriages	NOUN	26	nmod
31	de	ADP	31	case
32	X	SYM	29	nmod
33	sous	ADP	34	case
34	l'	DET	34	det
35	action	NOUN	24	nmod
36	du	_	None	_
37	de	ADP	37	case
38	le	DET	37	det
39	groupe	NOUN	34	nmod
40	symétrique	ADJ	37	amod
41	G	NOUN	37	appos
42	=	SYM	39	flat:name
43	S	NOUN	40	flat:name
44	,	PUNCT	44	punct
45	qui	PRON	44	nsubj
46	permute	VERB	37	acl:relcl
47	les	DET	46	det
48	sommets	NOUN	44	obj
49	donc	CCONJ	49	cc
50	les	DET	49	det
51	paires	NOUN	46	conj
52	de	ADP	51	case
53	sommets	NOUN	49	nmod
54	.	PUNCT	5	punct