3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
int n, root, sum, val[200005];
int siz[200005], mx[200005];
int anspos = 0;
double ansval = 1e20;
bool vis[200005];
struct Edge {
  int next, to, dis;
} edge[200005 << 1];
int head[200005], cnt = 1;
void add_edge(int from, int to, int dis) {
  edge[++cnt].next = head[from];
  edge[cnt].to = to;
  edge[cnt].dis = dis;
  head[from] = cnt;
}
template <class T>
T Max(T a, T b) {
  return a > b ? a : b;
}
template <class T>
void read(T &x) {
  char c;
  int sign = 1;
  while ((c = getchar()) > '9' || c < '0')
    if (c == '-') sign = -1;
  x = c - 48;
  while ((c = getchar()) >= '0' && c <= '9') x = (x << 1) + (x << 3) + c - 48;
  x *= sign;
}
void getroot(int rt, int fa) {
  mx[rt] = 0;
  siz[rt] = 1;
  for (int i = head[rt]; i; i = edge[i].next) {
    int v = edge[i].to;
    if (v == fa || vis[v]) continue;
    getroot(v, rt);
    siz[rt] += siz[v];
    mx[rt] = Max(mx[rt], siz[v]);
  }
  mx[rt] = Max(mx[rt], sum - siz[rt]);
  if (!root || mx[rt] < mx[root]) root = rt;
}
double sumval, p[200005];
void calc(int rt, int fa, double dis) {
  sumval += pow(dis, 1.5) * val[rt];
  for (int i = head[rt]; i; i = edge[i].next) {
    int v = edge[i].to;
    if (v == fa) continue;
    calc(v, rt, dis + edge[i].dis);
  }
}
void dfs(int rt, int fa, double dis) {
  p[root] += 1.5 * pow(dis, 0.5) * val[rt];
  for (int i = head[rt]; i; i = edge[i].next) {
    int v = edge[i].to;
    if (v == fa || vis[v]) continue;
    dfs(v, rt, dis + edge[i].dis);
  }
}
void solve(int rt, int fa) {
  if (vis[rt]) return;
  vis[rt] = 1;
  sumval = 0;
  calc(rt, 0, 0);
  if (sumval < ansval) ansval = sumval, anspos = rt;
  double sump = 0;
  for (int i = head[rt]; i; i = edge[i].next) {
    int v = edge[i].to;
    root = v;
    dfs(v, rt, 0);
    sump += p[v];
  }
  for (int i = head[rt]; i; i = edge[i].next) {
    int v = edge[i].to;
    if (sump - 2 * p[v] < 0) {
      sum = siz[v];
      root = 0;
      getroot(v, rt);
      solve(v, rt);
      break;
    }
  }
}
int main() {
  read(n);
  for (int i = 1; i <= n; ++i) read(val[i]);
  for (int i = 1; i < n; ++i) {
    int x, y, z;
    read(x);
    read(y);
    read(z);
    add_edge(x, y, z);
    add_edge(y, x, z);
  }
  sum = n;
  getroot(1, 0);
  solve(root, 0);
  printf("%d %.10lf\n", anspos, ansval);
  return 0;
}
