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>
#pragma GCC optimize("Ofast")
using namespace std;
inline long long read() {
  long long x = 0, f = 1;
  char c = getchar();
  for (; !isdigit(c); c = getchar())
    if (c == '-') f = -1;
  for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
  return x * f;
}
inline void write(long long x) {
  if (x < 0) x = -x, putchar('-');
  if (x >= 10) write(x / 10);
  putchar(x % 10 + '0');
}
inline void writeln(long long x) {
  write(x);
  putchar('\n');
}
inline void wri(long long x) {
  write(x);
  putchar(' ');
}
const int maxn = 200005;
struct Edge {
  int to, nxt, dist;
  Edge() {}
  Edge(int to, int nxt, int dist) : to(to), nxt(nxt), dist(dist) {}
} edge[maxn * 2];
int first[maxn], nume, a[maxn];
void Addedge(int a, int b, int v) {
  edge[nume] = Edge(b, first[a], v);
  first[a] = nume++;
}
vector<int> V;
int size[maxn], mx[maxn], vis[maxn];
void getrt(int u, int fa) {
  V.push_back(u);
  size[u] = 1, mx[u] = 0;
  for (int e = first[u]; ~e; e = edge[e].nxt) {
    int v = edge[e].to;
    if (vis[v] || v == fa) continue;
    getrt(v, u);
    size[u] += size[v];
    mx[u] = max(mx[u], size[v]);
  }
}
double sub = 0, cost = 0, ans;
void calc(int u, int fa, int dis) {
  sub += sqrt(1. * dis) * a[u];
  cost += sqrt(1. * dis) * dis * a[u];
  for (int e = first[u]; ~e; e = edge[e].nxt) {
    int v = edge[e].to;
    if (v != fa) calc(v, u, dis + edge[e].dist);
  }
}
int pos, n;
void divide(int rt) {
  V.clear();
  getrt(rt, -1);
  int u = -1;
  for (auto w : V) {
    mx[w] = max(mx[w], size[rt] - size[w]);
    if (u == -1 || mx[w] < mx[u]) u = w;
  }
  vis[u] = true;
  double Mx = 0;
  int t = u;
  for (int e = first[u]; ~e; e = edge[e].nxt) {
    int v = edge[e].to;
    sub = 0;
    calc(v, u, edge[e].dist);
    if (sub > Mx) Mx = sub, t = edge[e].to;
  }
  if (cost < ans) ans = cost, pos = u;
  if (!vis[t]) divide(t);
}
int main() {
  ans = 1e100;
  n = read();
  for (register int i = (1); i <= int(n); ++i) a[i] = read();
  memset(first, -1, sizeof(first));
  nume = 0;
  for (register int i = (1); i < int(n); ++i) {
    int x = read(), y = read(), v = read();
    Addedge(x, y, v);
    Addedge(y, x, v);
  }
  memset(vis, false, sizeof(vis));
  divide(1);
  printf("%d %.10lf\n", pos, ans);
  return 0;
}
